A matrix is called sparse if most of its entries are zero (or empty). Sparse matrices can be store efficiently by only recording the entroes with actual values. However, this can make algorithms to deal with sparse matrices more complicated.
Used on page 407
Also known as sparse matrices